ONE-DIMENSIONAL CUTTING STOCK PROBLEM THAT MINIMIZES THE NUMBER OF DIFFERENT PATTERNS
نویسندگان
چکیده
Cutting stock problem (CSP) is a of cutting an object into several smaller objects to fulfill the existing demand with minimum unused remaining. Besides minimizing remaining object, sometimes there another additional in CSP, namely number different patterns. This happens because setup cost for each pattern. study shows way obtain patterns (CSP). An example modeled linear programming and then solved by column generation algorithm using Lingo 18.0 software.
منابع مشابه
An ACO algorithm for one-dimensional cutting stock problem
The one-dimensional cutting stock problem, has so many applications in lots of industrial processes and during the past few years has attracted so many researchers’ attention all over the world. In this paper a meta-heuristic method based on ACO is presented to solve this problem. In this algorithm, based on designed probabilistic laws, artificial ants do select various cuts and then select the...
متن کاملThe Number of Setups (Different Patterns) in One-Dimensional Stock Cutting
The primary objective in cutting and packing problems is trim loss or material input minimization (in stock cutting) or value maximization (when packing into a knapsack). However, in real-life production we usually have many other objectives (costs) and constraints, for example, the number of different patterns. We propose a new simple model for setup minimization (in fact, an extension of the ...
متن کاملan aco algorithm for one-dimensional cutting stock problem
the one-dimensional cutting stock problem, has so many applications in lots of industrial processes and during the past few years has attracted so many researchers’ attention all over the world. in this paper a meta-heuristic method based on aco is presented to solve this problem. in this algorithm, based on designed probabilistic laws, artificial ants do select various cuts and then select the...
متن کاملNonlinear cutting stock problem model to minimize the number of different patterns and objects
In this article we solve a nonlinear cutting stock problem which represents a cutting stock problem that considers the minimization of, both, the number of objects used and setup. We use a linearization of the nonlinear objective function to make possible the generation of good columns with the Gilmore and Gomory procedure. Each time a new column is added to the problem, we solve the original n...
متن کاملChoice of Method for General One-Dimensional Cutting Stock Problem
Problems in operations research are often NP complete and optimal solution for larger problems cannot be obtained, therefore heuristic methods have to be used. The boundary between the size of the problem that can be solved optimally and those where heuristic methods should be used is not always clear. To solve this problem we propose a method based on decision trees. The method can be also use...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Barekeng
سال: 2022
ISSN: ['1978-7227', '2615-3017']
DOI: https://doi.org/10.30598/barekengvol16iss3pp805-814